Co-inductive Proofs for Streams in PVS
نویسنده
چکیده
We present an implementation in the theorem prover PVS of co-inductive stream calculus. Stream calculus can be used to model signal flow graphs, and thus provides a nice mathematical foundation for reasoning about properties of signal flow graphs, which are again used to model a variety of systems such as digital signal processing. We show how proofs by co-induction are used to prove equality of streams, and present a strategy to do this automatically.
منابع مشابه
Assertion-Based Analysis of Hybrid Systems with PVS
Hybrid automata are a well-established mathematical model for discrete systems acting in a continuous environment. We present assertion-based proof methods for hybrid systems for inductive assertional proofs. The model and the proof-methods are rigorously formalized within the PVS theorem-prover. We validate the applicability of the approach on a number of examples.
متن کاملFormal Specification and Verification of a Narrow Bandwidth Protocol in PVS
The paper presents a protocol for connection-establish service over an extreme-narrow bandwidth channel. The protocol is modeled and verified in a theorem proving system PVS. The PVS formalization and proofs of properties are performed. The execution behaviors of the protocol are modeled by state traces. Inductive methods were used to verify three important properties of the protocol. The three...
متن کاملFormal Verification of the Implementability of Timing Requirements
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly considered tolerances on property durations and intersample jitter. In this work we identify three environmental assumptions and compare the implementability of a Held For operator in each of them, formalizing this analysis...
متن کاملAffine functions and series with co-inductive real numbers
We extend the work of A. Ciaffaglione and P. di Gianantonio on mechanical verification of algorithms for exact computation on real numbers, using infinite streams of digits implemented as a co-inductive type. Four aspects are studied: the first aspect concerns the proof that digit streams can be related to axiomatized real numbers when they are already present in the proof system. The second as...
متن کاملUsing PVS for an Assertional Verification of the RPC-Memory Specification Problem
The RPC-Memory Speciication Problem has been speciied and veriied in an assertional method, supported by the veriication system PVS. Properties of the components are expressed in the higher-order logic of PVS and all implementations have been veriied by means of the interactive proof checker of PVS. A simpliication of the memory speciication-allowing multiple atomic reads-has been proved correc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007